Large joints in graphs
نویسندگان
چکیده
We show that if r s 2; n > r8; and G is a graph of order n containing as many r-cliques as the r-partite Turán graph of order n; then G has more than nr 1=r2r+12 cliques sharing a common edge unless G is isomorphic to the r-partite Turán graph of order n. This structural result generalizes a previous result that has been useful in extremal graph theory.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملA particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملStudy on Graphs of Kinematic Chains
In this paper the author used graph theory and combinatorial analysis for enumeration of graphs of kinematic chains. Contracted graphs with up to four loops and six vertices are provided in Table 4. Based on the concept of expansion from contracted graphs, conventional graphs are generated. Conventional graphs with up to three independent loops and eight vertices are tabulated in Tables 5,6,7, ...
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملنقش سینوویورتز با فسفر رادیواکتیو در درمان آرتروپاتی هموفیلیک
Background: Radioactive synoviorthesis by injection of safe radioisotopes into the joints affected to chronic arthritis is accounted as a novel method to treat haemophilic arthropathy. The main goal of this therapy would be decrease in frequency of hemarthrosis and consumption of coagulation factors. In this study we assessed the effect of radioactive synoviorthesis on the frequency of hemarthr...
متن کاملComparing the Pattern of Lower Limb Joints Coordination in an Optional and Selective Sprint Start of Elite Women Runners
Objective: The sprint start is a complex skill characterized by a multi-joint and multi-plane task requiring complex muscle coordination to reach a large force exerted in the horizontal direction in a short time. Previous studies indicated that efficient acceleration over the first portion of a race is influenced by how a sprinter is positioned in the set command blocks. Methods: A total of 15...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011